目标被动式跟踪评述

首先介绍了目标被动跟踪的发展状况，然后按照不同的量测源分别对现有的被动跟踪方法进行讨论，并给出了各种方法的适用范围和各自的优缺点。最后试探性地给出目标被动跟踪的发展趋势，及其需要解决的重点、难点问题。     

大坝监测自动化中的人工比测研究

阐述了人工比测的概念、方式和数据分析方法,对人工比测及数据分析中应注意的问题也进行了深入研究。     

A Multilayer Optical Packet Switching Network Based on the Kautz Graph and Optical Passive Star Couplers

The multihop optical network is the most appropriate solution to satisfy the increasing applications of Internet services. This paper extends the regular Kautz graph to one with multiple layers in order to produce more architectural variations. The connectivity between adjacent layers utilizes the systematic connection patterns of a regular Kautz graph. A routing algorithm based on its property is presented. Optical passive star (OPS) couplers are adopted to implement our new topologies. Three scheduling criteria that can solve the contention problem in the intermediate nodes are evaluated and compared in terms of their capability to improve the accessibility.     

Occupational Factors and 5-Year Weight Change Among Men in a Danish National Cohort.

This study explored whether factors related to the work environment could predict changes in body mass index (BMI) and whether the effect of psychosocial factors was dependent on baseline BMI. The sample consisted of 1,980 male employees from the Danish National Work Environment Cohort Study. Changes in BMI between 1995 and 2000 were analyzed, by multiple regression, as a function of background variables and a series of occupational variables obtained in 1995. Age, baseline BMI, job insecurity, and psychological demands predicted changes in BMI. Job insecurity and high or low psychological demands increased the likelihood of weight gain among obese employees, whereas they increased the likelihood of weight loss among employees with a low BMI. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Topology optimization of trusses using genetic algorithm,force method and graph theory

In this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd.     

（2m，2，m）非线性等重码不是最佳检错码

本文证明了当ｍ＞４时（２ｍ，２，ｍ）非线性等重码不是最佳检错码。     

超高分子量聚乙烯的辐照效应

通过密度测定和ＤＳＣ热分析，观测了超高分子量聚乙烯的辐射效应。实验结果表明：在吸收剂量０—１．１３ＭＧｙ范围内，密度随吸收剂量的增加而增大，熔化热和熔点也有所增加，特别是在低剂量范围内增加十分明显。以上结果都说明，超高分子量聚乙烯在辐照过程中，结晶在完善或有新的结晶形成     

用金字塔图法匹配边界图象的三眼立体视觉方法

本文在分析了双眼立体视觉面临的本质困难之后，提出了用金字塔图法匹配特征基元的三眼立体视觉方法，这种方法由于建筑在透视投影几何原理的稳固基础上，无须任何先验限制，也不以图象相似性为基础，故可较好地解决精度与匹配难度的矛盾，且运用金字塔图法进行匹配传播使在保证精度的基础上，匹配速度大大提高，对计算机人工图象的匹配结果表明，误匹配率几乎为零，且有较高的匹配速度和精度。     

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.